| Definitions | lastchange(x;e), P   Q, Atom$n, isrcv(k), es-first-from(es;e;l;tg), isrcv(e), es-init(es;e), destination(l), source(l), kind(e), {T}, (last change to x before e), @e(x v),  e (e1,e2].P(e),  e(e1,e2].P(e), e[e1,e2].P(e), e[e1,e2].P(e), e[e1,e2).P(e), e[e1,e2).P(e), e e'.P(e), e<e'. P(e), ee'.P(e), e<e'.P(e), x:A. B(x), e c e', e loc e' , Dec(P), {x:A| B(x)} , (e <loc e'), (e < e'), loc(e), X(e),  , p   q, p  q, p  q, e = e', deq-member(eq;x;L), a = b, a = b, qeq(r;s), q_less(a;b), q_le(r;s), eq_atom$n(x;y), [d], a < b, x f y, a < b, null(as), x =a y, (i = j), i z j, i <z j, p =b q, P Q, A c B, tt,  b, first(e), False, Void, pred(e), ff, P Q, x dom(f), (x l), if b then t else f fi , case b of inl(x) => s(x) | inr(y) => t(y), t.1, E, e X, E(X), prior(X), let x,y = A in B(x;y), AbsInterface(A), ES, Top, P & Q,   x. t(x), first(e), pred(e), A, <a, b>, x,y. t(x;y), pred!(e;e'),  , SWellFounded(R(x;y)), constant_function(f;A;B),  b,  , e < e', r s, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time),  , type List, Msg(M), kind(e), loc(e), Knd, kindcase(k; a.f(a); l,t.g(l;t) ), EOrderAxioms(E; pred?; info), x:A  B(x), IdLnk, left + right, Unit, EqDecider(T), Type, P Q, strong-subtype(A;B),  , Id, f(a), a:A fp B(a), EState(T), x:A. B(x), x:A B(x), t T, s = t |